Adaptive Initialized Jacobi Optimization in Independent Component Analysis
نویسندگان
چکیده
In this paper, we focus on the fourth order cumulant based adaptive methods for independent component analysis. We propose a novel method based on the Jacobi Optimization, available for a wide set of minimum entropy (ME) based contrasts. In this algorithm we adaptively compute a moment matrix, an estimate of some fourth order moments of the whitened inputs. Starting from this matrix, the solution to the n-dimensional ME ICA problem may be solved at any time by means of the Jacobi Optimization approach. In the experiments included, we compare this method to previous ones such as the adEML or the EASI, obtaining a better performance.
منابع مشابه
Initialized Jacobi Optimization in Independent Component Analysis
The authors propose a new solution to the minimization of marginal entropies (ME) in multidimensional independent component analysis (ICA). Starting from the ’Jacobi optimization’ (JO), we focus on a novel method based on initialization. In this method, we first compute the moment matrix for the prewhitened inputs. Then, the moments at each iteration of this Initialized Jacobi Optimization (IJO...
متن کاملAdaptive Dynamic Programming.fm
An Adaptive Dynamic Programming algorithm for nonlinear systems with unknown dynamics is developed. The algorithm is initialized with a positive definite cost functional / stabilizing control law pair (V0, k0) (coupled via the Hamilton Jacobi Bellman Equation). Given (Vi, ki), one runs the system using control law ki recording the state and control trajectories, with these trajectories used to ...
متن کاملHigh-Order Constrasts for Independent Component Analysis
This article considers high-order measures of independence for the independent component analysis problem and discusses the class of Jacobi algorithms for their optimization. Several implementations are discussed. We compare the proposed approaches with gradient-based techniques from the algorithmic point of view and also on a set of biomedical data.
متن کاملOptimization on the Orthogonal Group for Independent Component Analysis
This paper derives a new algorithm that performs independent component analysis (ICA) by optimizing the contrast function of the RADICAL algorithm. The core idea of the proposed optimization method is to combine the global search of a good initial condition with a gradient-descent algorithm. This new ICA algorithm performs faster than the RADICAL algorithm (based on Jacobi rotations) while stil...
متن کاملWorkshop on Statistical Signal and Array Processing A BATCH SUBSPACE ICA ALGORITHM
For the blind separation of sources (BSS) problem (or the independent component analysis (ICA)), it has been shown in many situations, that the adaptive subspace algorithms are very slow and need an important computation e orts. In a previous publication, we proposed a modi ed subspace algorithm for stationary signals. But that algorithm was limited to stationary signals and its convergence was...
متن کامل